Memetic Computing using Simulated Annealing for Dynamic Vehicle Routing Protocol

This paper addresses the dynamic vehicle routing problem. The proposed work includes the optimization in path selection using simulated annealing and hybrid memetic-genetic algorithm. In this paper, first we apply simulated annealing approach to the input of VRP.We use standard SA method that includes various types of move including insertion move, swap move,2-opt move,3-opt move to solve VRP.Then the output of SA approach will be given as the input to hybrid memetic-genetic algorithm. In hybrid memetic-GA approach, there will be standard operation of GA and a local search method. The aim of the approach are to produce a better solution with a short time limit, to design an efficient and effective distribution network in order to deliver the produced goods to the customer with the lowest cost and in shortest possible time frame.